Approximation algorithms - PDFSEARCH.IO - Document Search Engine

Approximation algorithms
Results: 332

#	Item
171	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Fast Additive Constant Approximation Algorithms for The Safe Deposit Boxes Problem with Two and Three Currencies Boaz Ben-Moshe∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:30:52 Dynamic programming Combinatorial optimization Cryptography Knapsack problem Operations research Algorithm Baby-step giant-step Ordinal arithmetic Mathematics Theoretical computer science Applied mathematics
172	Parameterized Approximation via Fidelity Preserving Transformations Michael R. Fellows1 , Ariel Kulik2 , Frances Rosamond1 , and Hadas Shachnai3? 1 School of Engineering and IT, Charles Darwin Univ., Darwin, NT Australi Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2012-03-01 11:15:08 NP-complete problems Analysis of algorithms Parameterized complexity Graph coloring Kernelization Dominating set Vertex cover Time complexity Steiner tree problem Theoretical computer science Computational complexity theory Applied mathematics
173	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximation Algorithms for the Minimum-Length Corridor and Related Problems Arturo Gonzalez-Gutierrez∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:25:22 NP-complete problems Operations research Approximation algorithm Travelling salesman problem APX Steiner tree problem Algorithm Set cover problem Reduction Theoretical computer science Computational complexity theory Applied mathematics
174	There is No EPTAS for Two-dimensional Knapsack Ariel Kulik∗ Hadas Shachnai† Abstract Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2010-12-30 12:50:07 Dynamic programming Operations research Complexity classes Approximation algorithms Polynomial-time approximation scheme Knapsack problem Subset sum problem Parameterized complexity Optimization problem Theoretical computer science Computational complexity theory Applied mathematics
175	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Fault Tolerant Clustering Revisited Nirman Kumar∗ Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:56 Approximation algorithms Computational complexity theory Cluster analysis Data mining Geostatistics K-means clustering K-medians clustering Metric k-center Algorithm Mathematics Theoretical computer science Statistics
176	What is the nearest neighbor in high dimensional spaces? Alexander Hinneburgy Charu C. Aggarwalz y Institute of Computer Science, University of Halle Add to Reading List Source URL: fusion.cs.uni-magdeburg.de Language: English - Date: 2002-10-04 04:14:52 Artificial intelligence Machine learning Numerical analysis Approximation algorithms Data mining Nearest neighbor search K-nearest neighbor algorithm R-tree IDistance Information science Search algorithms Mathematics
177	Fast Additive Constant Approximation Algorithms for The Safe Deposit Boxes Problem with Two and Three Currencies Boaz Ben-Moshe1 1 Yefim Dinitz2 Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:26:42 Ordinal numbers Logic Ordinal arithmetic Set theory Curry–Howard correspondence Mathematical logic Proof theory Mathematics
178	CCCG 2011, Toronto ON, August 10–12, 2011 Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks Minati De∗† Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Mathematics Dominating set Unit disk graph Independent set APX Approximation algorithm Vertex cover Planar separator theorem Theoretical computer science Graph theory NP-complete problems
179	Top-k Aggregation Using Intersections of Ranked Inputs Ravi Kumar Kunal Punera Torsten Suel Add to Reading List Source URL: www.wsdm2009.org Language: English - Date: 2009-04-14 09:42:15 Operations research Mathematical optimization Search algorithms Theoretical computer science Convex optimization Algorithm Nearest neighbor search Linear programming Approximation algorithm Mathematics Information science Applied mathematics
180	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Achieving Spatial Adaptivity while Finding Approximate Nearest Neighbors Jonathan Derryberry Don Sheehy Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:07:59 Search algorithms Discrete geometry Approximation algorithms Data mining Information retrieval Nearest neighbor search Z-order curve Quadtree K-nearest neighbor algorithm Information science Mathematics Geometry

UPDATE